Maximization of A convex quadratic function under linear constraints
نویسنده
چکیده
منابع مشابه
Global Maximization of a Generalized Concave Multiplicative Problem in the Outcome Space
In this work we propose an outcome space approach for globally solving generalized concave multiplicative problems, a special class of nonconvex problems which involves the maximization of a finite sum of products of concave functions over a nonempty compact convex set. It is shown that this nonconvex maximization problem can be reformulated as an indefinite quadratic problem with infinitely ma...
متن کاملFree-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
We consider dual coordinate ascent methods for minimizing a strictly convex (possibly nondifferentiable) function subject to linear constraints. Such methods are useful in large-scale applications (e.g., entropy maximization, quadratic programming, network flows), because they are simple, can exploit sparsity and in certain cases are highly parallelizable. We establish their global convergence ...
متن کاملFree - Steering Relaxation
Working Papers are interim reports on work of the International Institute for Applied Systems Analysis and have received only limited review. Views or opinions expressed herein do not necessarily represent those of the Institute, its National Member Organizations, or other organizations supporting the work. Abstract We consider dual coordinate ascent methods for minimizing a strictly convex (po...
متن کاملAn Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...
متن کاملLinear Objective Function Optimization with the Max-product Fuzzy Relation Inequality Constraints
In this paper, an optimization problem with a linear objective function subject to a consistent finite system of fuzzy relation inequalities using the max-product composition is studied. Since its feasible domain is non-convex, traditional linear programming methods cannot be applied to solve it. We study this problem and capture some special characteristics of its feasible domain and optimal s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 11 شماره
صفحات -
تاریخ انتشار 1976